Solves the most short - path using the dynamic programming algorithm 利用动态规划算法求解最短路径
Dynamic programming algorithm of bottleneck transportation problem based on entropy 基于熵的瓶颈运输问题的动态规划解
Dynamic programming algorithm of m - dimensional bottleneck assignment problem based on entropy 维瓶颈指派问题的动态规划解
In this paper , a new dynamic programming algorithm for unconstrained 2d stock cutting problem is presented 摘要本文给出了一种求解无限制板材下料问题的动态规划解法,对该算法的计算复杂度进行了分析。
This paper is to establish a system based on electronic map for motorcade - optimized dispatching , and dynamic programming algorithm is used to realize vehicle dispatching 本文的中心内容是:组建了一个基于电子地图大型车队优化调度及管理系统,并用动态规划算法实现了车辆的智能调度。